Sparse halves in triangle-free graphs
نویسندگان
چکیده
One of Erdős’ favourite conjectures was that any triangle-free graph G on n vertices should contain a set of n/2 vertices that spans at most n2/50 edges. We prove this when the number of edges in G is either at most n2/12 or at least n2/5. © 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Sparse halves in dense triangle-free graphs
In this paper we study the conjecture that any triangle-free graph G on n vertices should contain a set of bn/2c vertices that spans at most n2/50 edges. This problem was considered by Erdős, Faudree, Rousseau and Schelp in [5]. Krivelevich proved the conjecture for graphs with minimum degree at least 2 5n [8]. In [7] Keevash and Sudakov improved this result to graphs with average degree at lea...
متن کاملOn path-cycle decompositions of triangle-free graphs
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the characterization of the class of all triangle-free graphs with odd distance at least 3 that admit a path-cycle decomposition with elements of length at least 4. As a conse...
متن کاملComplete subgraphs of random graphs
A classical theorem by Erdős, Kleitman and Rothschild on the structure of triangle-free graphs states that with high probability such graphs are bipartite. Our first main result refines this theorem by investigating the structure of the ’few’ triangle-free graphs which are not bipartite. We prove that with high probability these graphs are bipartite up to a few vertices. Similar results hold if...
متن کامل(5, 2)-Coloring of Sparse Graphs
We prove that every triangle-free graph whose subgraphs all have average degree less than 12/5 has a (5, 2)-coloring. This includes planar and projective-planar graphs with girth at least 12. Also, the degree result is sharp; we construct a minimal non(5, 2)-colorable triangle-free graph with 10 vertices that has average degree 12/5.
متن کاملOn Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices
Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world graphs (small-world, scale-free, heavy-tailed degree distribution) with efficiently calculable ground-truth solutions to the desired output. Reproducibility for current generators [1] used in benchmarking are somewhat la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 96 شماره
صفحات -
تاریخ انتشار 2006